Longest cycles in regular graphs
نویسندگان
چکیده
منابع مشابه
Longest Cycles in 3-connected 3-regular Graphs
I n t r o d u c t i o n . In this paper, we s tudy the following quest ion: How long a cycle must there be in a 3-connected 3-regular graph on n vertices? For planar graphs this question goes back to T a i t [6], who conjectured tha t any planar 3-connected 3-regular graph is hamiltonian. T u t t e [7] disproved this conjecture by finding a counterexample on 46 vertices. Using Tu t t e ' s exam...
متن کاملChords of Longest Cycles in Cubic Graphs
We describe a general sufficient condition for a Hamiltonian graph to contain another Hamiltonian cycle. We apply it to prove that every longest cycle in a 3-connected cubic graph has a chord. We also verify special cases of an old conjecture of Sheehan on Hamiltonian cycles in 4-regular graphs and a recent conjecture on a second Hamiltonian cycle by Triesch, Nolles, and Vygen. 1997 Academic Press
متن کاملLongest Induced Cycles in Cayley Graphs
In this paper we study the length of the longest induced cycle in the unitary Cayley graph Xn = Cay(Zn;Un), where Un is the group of units in Zn. Using residues modulo the primes dividing n, we introduce a representation of the vertices that reduces the problem to a purely combinatorial question of comparing strings of symbols. This representation allows us to prove that the multiplicity of eac...
متن کاملLongest Induced Cycles in Circulant Graphs
In this paper we study the length of the longest induced cycle in the unit circulant graph Xn = Cay(Zn; Z∗n), where Z∗n is the group of units in Zn. Using residues modulo the primes dividing n, we introduce a representation of the vertices that reduces the problem to a purely combinatorial question of comparing strings of symbols. This representation allows us to prove that the multiplicity of ...
متن کاملDestroying longest cycles in graphs and digraphs
In 1978, C. Thomassen proved that in any graph one can destroy all the longest cycles by deleting at most one third of the vertices. We show that for graphs with circumference k ≤ 8 it suffices to remove at most 1/k of the vertices. The Petersen graph demonstrates that this result cannot be extended to include k = 9 but we show that in every graph with circumference nine we can destroy all 9-cy...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1985
ISSN: 0095-8956
DOI: 10.1016/0095-8956(85)90058-9